Method of debiting an electronic payment means

ABSTRACT

The invention provides a method for protectedly debiting an electronic payment mechanism, such as a telephone card. In the communication protocol between the payment mechanism and a payment station, an authentication is used to identify the payment mechanism during various steps of the protocol. According to the invention, the authentications are mutually related by states of a cryptographic process in order to be capable of detecting an interference in the protocol. The method may be applied to existing payment cards having a dynamic memory, it being guaranteed that the contents of the dynamic memory, in which there is located information related to the authentication, is not lost during the protocol.

This application is a continuation of application Ser. No. 08/751,156filed on Nov. 15, 1996, now U.S. Pat. No. 5,907,832.

BACKGROUND OF THE INVENTION FIELD OF THE INVENTION

The invention relates to a method of debiting an electronic paymentmeans, such as an electronic payment card provided with an integratedcircuit ("chip card"). In particular, though not exclusively, theinvention relates to a method for protectedly debiting prepaidelectronic payment cards ("prepaid cards") as these are applied, e.g.,for telephone booths. In the present text, the term payment means willbe used irrespective of the form or the type of the specific paymentmeans. A payment means may therefore be formed by, e.g., a revaluablepayment card (i.e. a payment card whose balance may be increased) or anon-card-shaped electronic payment means.

In recent years, electronic payment means are being applied ever morefrequently, not only for paying for the use of public telephone sets,but also for many other payment purposes. Since such a payment meansgenerally comprises a (credit) balance which represents a monetaryvalue, it is necessary to have the exchange of data between such apayment means and a payment station (such as a telephone set designedfor electronic payment or an electronic cash register) run according toa protected method (payment protocol). Here, it should be ensured, e.g.,that an amount (monetary value or number of calculation units) debitedto the payment means correspond to an amount (monetary value orcalculation units) credited elsewhere: the amount paid by a customershould correspond to the amount to be received by a supplier. Thecredited amount may be stored, e.g., in a protected module present inthe payment station.

Prior Art payment methods, as disclosed in e.g. European PatentApplication EP 0,637,004 which is incorporated by reference in thistext, comprise: a first step, in which the balance of the payment meansis retrieved by the payment station; a second step, in which the balanceof the payment means is lowered (debiting the payment means); and athird step, in which the balance of the payment means is retrievedagain. From the difference between the balances of the first and thirdsteps the debited amount may be determined and therewith the amount tobe credited in the payment station. In order to prevent fraud here, inthe first step use is made of a random number which is generated by thepayment station and is transferred to the payment means. On the basis ofthe first random number, the payment means generates, as a firstresponse, an authentication code which may comprise an (e.g.,cryptographic) processed form of, inter alia, the random number and thebalance. By using a different random number for each transaction, it isprevented that a transaction may be imitated by replay. In addition, inthe third step use is made of a second random number, which is alsogenerated by the payment station and transferred to the payment means Onthe basis of the second random number the payment means generates, as asecond response, a second and new authentication code which may comprisea processed form of, inter alia, the second random number and the newbalance. On the basis of the difference between the two transferredbalances, the payment station (or a protected module of the paymentstation) determines by which amount the balance of the payment stationshould be credited.

Said known method is basically very resistant to fraud as long as apayment means communicates with one payment station (or protectedmodule). The drawback of the known method, however, lies in the factthat the first and second authentication codes are independent. If asecond or third payment station (or protected module) communicates withthe payment means, it is possible, due to said independence, to separatethe first step from the second and third steps. As a result, anapparently complete transaction may be achieved without the paymentmeans in question being debited. It will be understood that such isundesirable.

U.S. Pat. No. 5,495,098, incorporated by reference in this text,discloses a method in which the identity of the security module of thepayment station is used to ensure that a data exchange takes placebetween the card and one terminal only. The protection of the dataexchange between the security module, the station and the card isrelatively complicated and requires extensive cryptographiccalculations.

Other Prior Art methods are disclosed in e.g. European PatentApplications EP 0,223,213 and EP 0,570,924, but these documents do notoffer a solution to the above-mentioned problems.

SUMMARY OF THE INVENTION

It is an object of the invention to eliminate the above and otherdrawbacks of the Prior Art, and to provide a method which offers an evengreater degree of protection of debiting transactions. In particular, itis an object of the invention to provide a method which ensures thatduring a transaction only one payment station is credited.

Accordingly, the present invention provides a method of performing atransaction using an electronic payment means and a payment station, themethod comprising the repeated execution of an interrogation step inwhich the payment station interrogates the payment means and receivespayment means data in response, the payment means data comprising anauthentication code produced by a predetermined process, eachauthentication code being linked to a preceding authentication code ofthe same transaction by states of said process.

By providing a link between the authentication codes, it can be ensuredthat the payment means data received by the payment station are uniqueto that payment station. In order to link the authentication codes ofthe different steps the process, in an interrogation step, preferablyuses an initial value derived from the final state of the process in thepreceding interrogation step.

More specifically, the present invention provides a method ofprotectedly debiting an electronic payment means using a paymentstation, the method comprising:

a first step, in which:

the payment station transfers a first random value to the payment means,

the payment means, in response to said first random value, transfers afirst authentication code to the payment station, which authenticationcode is determined on the basis of at least a first start value, thefirst random value and the current balance of the payment means using apredetermined process, the process further producing a first end value,

a second step, in which:

the payment station transfers a debiting command to the payment means,and the balance of the payment means is lowered on the basis of thedebiting command, and

a third step, in which:

the payment means transfers a second random value to the payment means,and the payment means, in response to said second random value,transfers a second authentication code to the payment station, whichauthentication code is determined on the basis of at least a secondstart value, the second random value and the current balance of thepayment means using said process, the second start value being based onthe first end value.

The method according to the invention is thus characterized in that thesecond start value is based on the first end value.

By basing the second start value on the first end value, i.e. on thestate of the process after completion of the first authentication code,a direct coupling between the first step and the remaining steps isobtained and it is no longer possible to interrupt the method, or toexchange data with other payment stations, without such being noticed.Here, the second start value, which may form, e.g., the initializationvector of a cryptographic process, may be identical to the first endvalue or be derived from the first end value. In the first case thefirst end value may be stored, in the second case the second start valuemay be, e.g., the state of a (cryptographic) process which, startingfrom the first end value, has been executed a number of times. In eithercase, the second start value may be reproduced from the first end value,as a result of which a check on the authenticity is offered, and therebyon the continuity of the method.

The process may, in the third step, produce a second end value which maybe used for deriving start values for possible additional steps.

The invention is therefore based on the insight that the application ofmultiple independent start values on authentications in consecutivesteps of a debiting transaction under certain circumstances creates thepossibility that not all steps of the transaction are carried outbetween the same pair of a payment means and a payment station.

The invention further provides an advantageous implementation of thesaid method in existing electronic payment means.

In the above reference is made to a payment station with which thepayment means (card) communicates. A payment station may have anintegrated storage of transaction data or a separate module. It will beunderstood that the payment means may in practice communicate with theprotected module ("Security Module") via the payment station in case thepayment station uses such a module for the secure storage of transactiondata.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be explained in greater detail below by reference tothe Figures.

FIG. 1 schematically shows a payment system in which the invention maybe applied.

FIG. 2 schematically shows a method in which the invention is applied.

FIG. 3 schematically shows further details of a method in which theinvention is applied.

FIG. 4 schematically shows an alternative embodiment of the method ofFIG. 3.

FIG. 5 schematically shows the integrated circuit of a payment meanswith which the invention may be applied.

PREFERRED EMBODIMENTS

The system 10 for electronic payment schematically shown in FIG. 1, byway of example comprises an electronic payment means, such as aso-called chip card or smart card 11, a payment station 12, a firstpayment institution 13, and a second payment institution 14. The paymentstation (terminal) 12 is shown in FIG. 1 as a cash register, but mayalso comprise, e.g., a (public) telephone set. The payment institutions13 and 14, both denoted as bank in FIG. 1, may not only be banks butalso further institutions having at their disposal means (computers) forsettling payments. In practice, the payment institutions 13 and 14 mayform one payment institution. In the example shown, the payment means 11comprises a substrate and an integrated circuit having contacts 15,which circuit is designed for processing (payment) transactions. Thepayment means may also comprise an electronic wallet.

Between the payment means 11 and the payment station 12 there takesplace, during a transaction, an exchange of payment data PD1. Thepayment means 11 is associated with the payment institution 13, whilethe payment station 12 is associated with the payment institution 14.Between the payment institutions 13 and 14 there takes place, after atransaction, a settlement by exchanging payment data PD2, which isderived from the payment data PD1. During a transaction there basicallydoes not take place communication between the payment station 12 and thepayment institution 14 in question (so-called offline system).Transactions must therefore occur under controlled conditions to ensurethat there can take place no abuse of the system. Such an abuse may be,e.g., increasing a balance of the payment means (card) 11 which is notmatched by a balance change of a counterpart account at the paymentinstitution 13.

The diagram of FIG. 2 shows the exchange of data between (the integratedcircuit of) a payment means denoted as "Card" (11 in FIG. 1) and (thesecurity module of) a payment station denoted as "Terminal" (12 in FIG.1), with consecutive occurrences being shown one below the other.

In the first step, denoted by I, the terminal produces a first randomnumber R1 and transfers this number to the card (substep Ia). On thebasis of the random number R1 and other data, preferably including thecard balance S1, the card produces an authentication code MAC1=F(R1, S1,. . . ), where F may be a cryptographic function known per se. This willlater be further explained with reference to FIGS. 3 and 4. The codeMAC1 ("Message Authentication Code") is transferred to the terminalalong with at least the balance S1 (substep Ib). After checking theauthentication code MAC1, the terminal records the balance S1.

In the second step, denoted by II, the terminal produces a debitingcommand D, which comprises the value (amount) to be debited to the card.The debiting command D is transferred to the card, whereafter thebalance S1 of the card is lowered by the amount to be debited, resultingin a new balance S2. The carrying out of step II is not essential to theinvention. In practice, step II may be carried out an arbitrary numberof times, including zero.

In the third step, denoted by III, the terminal produces a second randomnumber R2 and transfers this to the card (substep IIIa). On the basis ofthe random number R2 and other data, including the new balance S2 of thecard, the card produces an authentication code MAC2=F(R2, S2, . . . ),where F may be a cryptographic function known per se. The new balance S2and the authentication code MAC2 are transferred to the terminal(substep IIIb). The terminal checks the authentication code MAC2, e.g.,by regenerating the code using R2 and S2, and comparing the regeneratedand received codes. Alternatively, the terminal may decipher the codeMAC2 to obtain R2 and S2. Said deciphering may take place, e.g., bycarrying out the inverse of the function F.

After a positive check of the code MAC2, the new balance S2 is recordedin the terminal.

In a fourth step, denoted by IV, the difference of the balances S1 andS2 is determined in the terminal and recorded there. In this connection,such difference may either be stored separately or be added to anexisting value (balance of the payment station) to be settled later.Said fourth step, as well as possible following steps, is not essentialfor the invention. The steps shown in FIG. 2 may be preceded by anauthentication or verification step in which the key is identified whichis to be used for producing the authentication codes. Preferably, adifferent key is used for each batch of cards or even for eachindividual card. This may for example be accomplished by means of keydiversification on the basis of a card identity number, a technique wellknown in the art.

In the diagram discussed above, the random values R1 and R2 aredifferent. The random values R1 and R2 may be identical (R1=R2=R),however, so that in step III it may be checked whether in theauthentication code MAC2 use is still being made of the same randomnumber R (=R1).

According to the prior art, the authentication values MAC1 and MAC2 arebasically independent. This is to say that, if the random numbers R1 andR2 differ, there is no direct or indirect relationship between thevalues of MAC1 and MAC2 since the process (function F) with which theauthentication code is determined, always assumes the same start value,namely, the start value zero. Due to this independence, there isbasically no guarantee that the steps I and III are carried out betweenthe same pair of a card and a payment station.

According to the invention, however, when determining the secondauthentication code (MAC2) there is assumed a start value which is theresult of the determination of the first authentication code (MAC1). Asa second start value there may be used, e.g., the state of the(cryptographic) process after the determination of the firstauthentication code. In this connection it is not essential whether theprocess, after the determination of the first authentication code, hasstill gone through a number of process steps, since the dependence andthe reproducibility of the second start value will be guaranteed.

The dependence of the start values in accordance with the inventionensures that all steps of the transaction, in which the method accordingto the invention is applied, take place between the same card and thesame payment station.

The relationship between the start values will now be explained withreference to FIG. 3, in which the steps I and III may be identical tothe steps I and III in FIG. 2. In step I, the first authentication codeMAC1 is generated using a function F. which may be a cryptographicfunction known per se, such as a DES ("Data Encryption Standard")function, or a relatively simple combinatorial function (see also FIG.5) or "hash" function. This function F has the first random value R1,the first (old) balance S1, a key K and a first start value Q1 as inputparameters. Optionally, an identification of a debiting command (as usedin step II) may be used as input parameter. A clock pulse α, which maybe identical to the clock α of FIG. 5, is shown to control theprocessing.

The first start value (initialization vector) Q1 may be equal to zero orto another preset initial value if no previous processing involving thefunction F has taken place before activation of the card (activation maytake place by inserting the card in the terminal).

The function F produces an authentication code MAC1. Additionally, thestate ("residue") of the function F is saved as first end value Y1. Thisfirst end value Y1 will later be used in step III as second start valueQ2 (Q2=Y1), thus linking the first and third steps.

In step III, the second authentication code MAC2 is generated using thefunction F, which preferably is identical to the function F of step I.Here, the function F has the second random value R2, the second (new)balance S2, the key K and the second start value Q2 as input parameters.The function F produces the second authentication code MAC2 and,additionally, the second end value Y2 which is the state of the functionF after the processing. The second end value Y2 may be saved to be usedas third start value (Q3) in case a third authentication code (MAC3)involving the same card and security module (terminal) is required.Generally, the deactivation of the card (e.g. by removing the card fromthe terminal) will result in the current end value (e.g. Y2) being lost.This guarantees the uniqueness of the transaction.

FIG. 4 shows the case in which the processing of the function Fcontinues between the steps I and III under control of the clock α. StepI results in a code MAC1 and a first end value Y1, as in FIG. 3. Thisend value Y1 is "input" into the function F' as a starting value. Asstated above, the end value Y1 is the state of the function F aftercompletion of the code MAC1, so if the function continues processingsaid state maybe considered as start value. In FIG. 4, the function F isin step II denoted as F' as the function may not receive the inputparameters R1, S1 and K.

In step III, the state (end value) of the function F' is used as startvalue Q2. Subsequently, MAC2 is produced using F and the inputparameters R2, S2 and K.

In the example of FIG. 4, the start value Q2 is not identical to the endvalue Y1. However, the values Q2 and Y1 are related through the functionF'. This still allows a check on the correspondence between the steps Iand III.

It will be understood that the steps of FIGS. 3 and 4 are carried outboth in the card and in the (security module of the) terminal. That is,both the card and the terminal produce the codes MAC1 and MAC2 as shownin FIG. 3 or FIG. 4. By comparing the received code with its counterpartproduced in the terminal, it is possible for the terminal to determinethe authenticity of the data received and to ascertain that only asingle card is involved in the transaction.

On the basis of FIG. 5, it will be further explained how the methodaccording to the invention may be applied with commercially availablepayment cards.

The integrated circuit 100 schematically shown in FIG. 5, whichbasically corresponds to the integrated circuit 15 in the payment means11 of FIG. 1, comprises a first memory 101 and an address register 102.The memory 101 comprises multiple memory locations, which are addressedwith the help of the address register 102, which is constructed as acounter. In response to a clock pulse α, which is generated outside thepayment means, the address register 102 runs through a range ofaddresses. The memory 101 is constructed as a so called EPROM or EEPROMmemory and may, in response to (external) read/write signals R/W, beoptionally written or read. Data, i.e., balances S1, S2 etc., areexchanged, by means of a data bus 103, with other parts of theintegrated circuit 100.

A second memory 104 is constructed as a shift register having feedback.In many cases, said memory is formed by a dynamic memory, as a result ofwhich the information stored in the memory is lost if said informationis not regularly "refreshed." This point will be elaborated later. Therandom number R may be (temporarily) stored in an (optional) register105. To the second memory 104 there are fed, by way of an (optional)combination circuit 106, both the random number R and a balance S fromthe register 105 and the memory 101, respectively. Possibly, stillfurther parameters may be involved in the combination, such as a key Kstored in the memory 101. At the (fed-back) output of the memory (shiftregister) 104 there originates the authentication code MAC (i.e., MAC1,MAC2, . . . ), which has therefore originated from the encipheredcombination of the balance S, the random number R and possible otherparameters, such as an identification code (e.g., a card number), a keyK and the like. The feedback takes place by way of a number of modulo-2adders and the combination circuit 106. The circuits 104, 106 and theadders connected thereto constitute the functions F and F' of FIGS. 3and 4.

In practice, the integrated circuit 100 may comprise many other partswhich are not essential, however, for the present invention.

In the event of existing methods and their implementations, the problemarises that for writing data (in this case balances) to the EEPROMmemory 101 there is required a relatively long write time of, e.g., atleast 5 ms. During the writing, there are supplied clock and writesignals to the memory (shown as the signals d and R/W). In the event ofexisting payment cards, it is not possible during the writing to theEEPROM memory to supply another clock pulse to other parts of theintegrated circuit 100. As a result, the contents of the dynamic memory104 are lost, since said memory must regularly and within brief timeintervals of, e.g., at least 0.1 ms, receive a clock pulse for"refreshing" the memory contents. After the writing of a balance to theEEPROM memory 101 (step II in FIG. 2), therefore, the contents of thedynamic memory 104 are lost and said memory should therefore be reset inorder to achieve a defined initial state of the memory. Said reset maytake place by feeding a series of zeros (or ones) to the input of thememory 104. For this purpose, the combination circuit 106 may beconstructed in such a manner that on the basis of a certain controlsignal it issues only zeros (or ones) to its output.

Resetting the memory 104 has the drawback, however, that informationwhich is related to the earlier steps of the method (step I in FIG. 2)is thereby lost. According to the invention, therefore, the informationin the memory 104 is maintained. This is preferably achieved by havingthe writing of the data to the EEPROM memory 101 take place in such amanner that the refreshing of the dynamic memory 104 and possible otherdynamic-memory elements, e.g., the register 105, is not disturbed. Forthis purpose, the frequency of the clock pulse α is always maintained atsuch a value that the refreshing of the dynamic memories is notendangered. Depending on the dynamic memory elements used, the clockfrequency may amount to, e.g., at least 10 kHz. Since the (clock) pulseduration during the writing at such a clock frequency is too low (e.g.,0.05 ms at 10 kHz, while with a certain EEPROM memory there is requireda pulse duration of at least 5 ms), the writing is carried outrepeatedly. In other words, the same value (balance) is written to thesame address of the memory 101 several times, until at least the totalprescribed duration has been achieved. In the given example of a clockfrequency of 10 kHz and a minimum write time of 5 ms, this means that atotal of at least 100 times should be written to the same address.

The repeated write referred to above may be made difficult, however, bythe fact that with each clock pulse in many existing payment cards theaddress register is raised (or lowered) by one. The actual write maytherefore take place on only one of the many addresses, so that theentire address range should always be run through to write during one(relatively brief) clock pulse. As a result, the duration required forthe writing is extended.

According to a further aspect of the invention, a solution for this isoffered by varying the frequency of the clock a in such a manner that,during the running through of the address register and therefore in theabsence of the write signal, the frequency of the clock α is raised inorder to speed up running, and immediately before or during the writingthe clock frequency is lowered in order to have the write pulse continuelonger. It will be understood that the clock frequency can be loweredonly to the extent permitted by the required refreshing of the dynamicmemory.

Also, the shape of the clock pulse may advantageously be adjusted, sothat the 1/0 ratio amounts not to 50/50 but, e.g., to 70/30 or 90/10.This results in a longer write pulse (if writing takes place with aclock pulse equal to 1) and therefore in a shorter total write timewithout, however, disturbing the refreshing of the dynamic memory.

Adjusting the shape of the clock pulse may advantageously be combinedwith varying the clock frequency. In addition, the address register mayadvantageously be constructed in such a manner that it does not generatemore different addresses than strictly necessary. By restricting thenumber of possible addresses, the time required for running through theaddress register may be effectively restricted.

As explained above, the invention is based on the fact that noauthentication information is lost between the various steps of themethod. For this purpose, it is ensured that dynamic registers andmemories maintain their contents, even during a write to a memoryrequiring a relatively long write time, such as an EEPROM memory.

In practice, the method may be implemented in the form of software inthe payment station, particularly in a so-called card reader of thepayment station.

It will be understood by those skilled in the art that the invention isnot limited to the embodiments shown, and that many modifications andamendments are possible without departing from the scope of theinvention. Thus, the principle of the invention is described above onthe basis of debiting a payment means, but such principle may also beapplied to crediting a payment means.

What is claimed is:
 1. A method of performing a transaction between an electronic payment mechanism associated with a first payment institution, and a payment station associated with a second payment institution, comprising:requesting, by said payment station, payment data from said payment mechanism; generating a plurality of authentication codes in which each authentication code of said plurality of authentication codes is linked to a preceding authentication code in a same transaction between said payment mechanism and said payment station; transmitting, by said payment mechanism, said requested payment data including a respective authentication code of said plurality of authentication codes, to said payment station; and exchanging payment institution data, which is derived from payment data transacted between the payment mechanism and the payment station, between the first payment institution and the second payment institution.
 2. The method according to claim 1, wherein said step of generating said plurality of authentication codes generates at least one authentication code using an initial value derived from a final state of a previously generated authentication code.
 3. The method according to claim 1, wherein said step of generating said plurality of authentication codes generates at least one authentication code using a key.
 4. The method according to claim 1, wherein said step of generating said plurality of authentication codes generates at least one authentication code using a random value.
 5. A method of performing a transaction between an electronic payment mechanism associated with a first payment institution, and a payment station associated with a second payment institution, comprising:transferring, by said payment station, a first random value to said payment mechanism; determining a first authentication code using at least a first value, the first random value, and a first balance of said payment mechanism; generating a first end value corresponding to said first authentication code; transferring, by said payment mechanism in response to said first random value transferred by said payment station, said first authentication code to said payment station; transferring, by said payment station, a debiting command to said payment mechanism; reducing said first balance of said payment mechanism to a second balance using said debiting command; transferring, by said payment station, a second random value to said payment mechanism; determining a second authentication code using at least a second start value, the second random value, and said second balance of said payment mechanism; transferring, by said payment mechanism in response to said second random value transferred by said payment station, said second authentication code to said payment station; and exchanging payment institution data, which is derived from payment data transacted between the payment mechanism and the payment station, between the first payment institution and the second payment institution, wherein in said step of determining said second authentication code, said second start value is based on said first end value.
 6. The method according to claim 5, wherein in said step of determining said second authentication code, said second start value is identical to said first end value.
 7. The method according to claim 5, further comprising:determining at least one of said first authentication code and said seconded usentication code using a key and an identification code.
 8. The method according to claim 5, further comprising:determining said first end value, said first authentication code, and said second authentication code using a cryptographic function.
 9. The method according to claim 5, further comprising:transferring, by the payment mechanism, said first balance and said second balance to said payment station; and recording, by the payment station, a difference between said first balance and said second balance.
 10. The method according to claim 5, further comprising:setting said second random value to be identical to said first random value before transferring said second random value.
 11. The method according to claim 5, further comprising:repeatedly writing at least one of said first balance and said second balance to a rewritable memory of said payment mechanism in accordance with predetermined clock pulses such that contents of a dynamic memory of said payment mechanism are maintained, said contents of the dynamic memory including at least one of said first authentication code, said second authentication code, said first random number and said second random number.
 12. The method according to claim 11, wherein said step of repeatedly writing writes said at least one of said first balance and said second balance to said rewritable memory between 50 and 150 times.
 13. The method according to claim 11, further comprising:increasing a frequency of said predetermined clock pulses.
 14. The method according to claim 11, further comprising:adjusting a shape of said predetermined clock pulses to comprise an asymmetric 1/0. ratio.
 15. A smart card, comprising:means for storing data corresponding to a balance of said smart card; feedback means for producing at least one authentication code for said smart card; means for combining, which is connected to said means for storing and said feedback means, data from said means for storing and feedback data from said feedback means, and for inputting said combined data to said feedback means; and means for generating a clock pulse which controls an operation of said means for storing and said feedback means, wherein contents of said feedback means are maintained by varying at least one of a frequency and a ratio of said generated clock pulses.
 16. A smart card according to claim 15, further comprising:register means, connected to said means for combining, for storing a random value.
 17. A smart card, comprising:means for storing data corresponding to a balance of said smart card; feedback means for producing at least one authentication code for said smart card; means for combining, which is connected to the means for storing and the feedback means, data from said means for storing and feedback data from said feedback means, and for inputting said combined data to said feedback means; and means for generating a clock pulse which controls an operation of said means for storing and said feedback means, wherein contents of said feedback means are maintained by repeatedly writing said data corresponding to said balance to said means for storing between 50 and 150 times.
 18. A system of performing a transaction between an electronic payment mechanism and a payment station, comprising:means for requesting, by said payment station, payment data from said payment mechanism; means for generating a plurality of authentication codes in which each authentication code of said plurality of authentication codes is linked to a preceding authentication code in a same transaction between said payment mechanism and said payment station; and means for transmitting, by said payment mechanism, said requested payment data including a respective authentication code of said plurality of authentication codes, to said payment station.
 19. The system according to claim 18, wherein said means for generating said plurality of authentication codes generates at least one authentication code using an initial value derived from a final state of a previously generated authentication code.
 20. The system according to claim 18, wherein said means for generating said plurality of authentication codes generates at least one authentication code using a key.
 21. The system according to claim 18, wherein said means for generating said plurality of authentication codes generates at least one authentication code using a random value.
 22. A system of performing a transaction between an electronic payment mechanism and a payment station, comprising:means for transferring, by said payment station, a first random value to said payment mechanism; means for determining a first authentication code using at least a first value, the first random value, and a first balance of said payment mechanism; means for generating a first end value corresponding to said first authentication code; means for transferring, by said payment mechanism in response to said first random value transferred by said payment station, said first authentication code to said payment station; means for transferring, by said payment station, a debiting command to said payment mechanism; means for reducing said first balance of said payment mechanism to a second balance using said debiting command; means for transferring, by said payment station, a second random value to said payment mechanism; means for determining a second authentication code using at least a second start value, the second random value, and said second balance of said payment mechanism; and means for transferring, by said payment mechanism in response to said second random value transferred by said payment station, said second authentication code to said payment station; wherein in said means for determining said second authentication code, said second start value is based on said first end value.
 23. The system according to claim 22, wherein in said means for determining said second authentication code, said second start value is identical to said first end value.
 24. The system according to claim 22, further comprising:means for determining at least one of said first authentication code and said second authentication code using a key and an identification code.
 25. The system according to claim 22, further comprising:means for determining said first end value, said first authentication code, and said second authentication code using a cryptographic function.
 26. The system according to claim 22, further comprising:means for transferring, by the payment mechanism, said first balance and said second balance to said payment station; and means for recording, by the payment station, a difference between said first balance and said second balance.
 27. The system according to claim 22, further comprising:means for setting said second random value to be identical to said first random value before transferring said second random value.
 28. The system according to claim 22, further comprising:means for repeatedly writing at least one of said first balance and said second balance to a rewritable memory of said payment mechanism in accordance with predetermined clock pulses such that contents of a dynamic memory of said payment mechanism are maintained, said contents of the dynamic memory including at least one of said first authentication code, said second authentication code, said first random number and said second random number.
 29. The system according to claim 28, wherein said means for repeatedly writing writes said at least one of said first balance and said second balance to said rewritable memory between 50 and 150 times.
 30. The system according to claim 28, further comprising: means for increasing a frequency of said predetermined clock pulses.
 31. The system according to claim 28, further comprising:means for adjusting a shape of said predetermined clock pulses to comprise an asymmetric 1/0 ratio.
 32. A payment station used in a transaction with an electronic payment mechanism, comprising:a first mechanism configured to generate and transfer a first random value to the payment mechanism; and a second mechanism configured to determine whether or not an authentication code received from said payment mechanism is linked to a preceding authentication code in a same transaction between the payment mechanism and the payment station.
 33. The payment station according to claim 32, further comprising:a third mechanism configured to transfer a debiting command to the payment mechanism.
 34. The payment station according to claim 32, further comprising:a third mechanism configured to transfer payment data transacted between the payment station and the payment mechanism to a payment institution.
 35. An electronic payment mechanism used in a transaction with a payment station, comprising:a first mechanism configured to generate a plurality of authentication codes in which each authentication code of the plurality of authentication codes is linked to a preceding authentication code in a same transaction between the payment mechanism and the payment station; and a second mechanism configured to transfer a respective authentication code generated by said first mechanism to said payment station in response to a random value received from the payment station.
 36. The payment mechanism according to claim 35, wherein said first mechanism generates at least one authentication code of the plurality of authentication codes using the random value received from the payment station.
 37. The payment mechanism according to claim 35, wherein said first mechanism generates at least one authentication code of the plurality of authentication codes using a cryptographic function.
 38. The payment mechanism according to claim 35, wherein said first mechanism generates at least one authentication code of the plurality of authentication codes using an initial value derived from a final state of a previously generated authentication code.
 39. The payment mechanism according to claim 35, wherein said first mechanism generates at least one authentication code of the plurality of authentication codes using a balance of the payment mechanism.
 40. The payment mechanism according to claim 35, where said first mechanism generates at least one authentication code of the plurality of authentication codes using a key and an identification code.
 41. The payment mechanism according to claim 35, further comprising:a third mechanism configured to transfer payment data transacted between the payment station and the payment mechanism to a payment institution. 